Incremental Incomplete Lu Factorizations with Applications to Time-dependent Pdes

نویسنده

  • C. CALGARO
چکیده

This paper addresses the problem of computing preconditioners for solving linear systems of equations with a sequence of slowly varying matrices. This problem arises in many important applications. For example, a common situation in computational fluid dynamics, is when the equations change only slightly, possibly in some parts of the physical domain. In such situations it is wastful to recompute entirely any LU or ILU factorizations computed for the previous coefficient matrix. This papers examines a number of techniques for computing incremental ILU factorizations. For example we consider techniques based on approximate inverses as well as alternating techniques for updating the factors L and U of the factorization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Incomplete LU factorizations with applications to time-dependent PDEs

A common problem which arises in many complex applications is to solve a sequence of linear systems of the form: Akxk = bk, for k = 1, 2, .. In these applications Ak does not generally change too much from one step k to the next, as it is often the result of a continuous process (e.g. Ak can represent the discretization of some problem at time tk.) We are faced with the problem of solving each ...

متن کامل

Incremental incomplete LU factorizations with applications

This paper addresses the problem of computing preconditioners for solving linear systems of equations with a sequence of slowly varying matrices. This problem arises in many important applications. For example, a common situation in computational fluid dynamics, is when the equations change only slightly, possibly in some parts of the physical domain. In such situations it is wasteful to recomp...

متن کامل

On the Stability of Relaxed Incomplete Lu Factorizations

When solving large linear systems of equations arising from the discretization of elliptic boundary value problems, a combination of iterative methods and preconditioners based on incomplete LU factorizations is frequently used. Given a model problem with variable coefficients, we investigate a class of incomplete LU factorizations depending on a relaxation parameter. We show that the associate...

متن کامل

On the Relations between ILUs and Factored Approximate Inverses

This paper discusses some relationships between Incomplete LU (ILU) factoriza-tion techniques and factored sparse approximate inverse (AINV) techniques. While ILU factorizations compute approximate LU factors of the coeecient matrix A, AINV techniques aim at building triangular matrices Z and W such that W > AZ is approximately diagonal. The paper shows that certain forms of approximate inverse...

متن کامل

Symbolic Techniques for Domain Decomposition Methods

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today’s standard applications, it is necessary to rely on iterative Krylov methods that are scalable (i.e., weakly dependent on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008